Global Storing Mechanisms for Tabled Evaluation

Arguably, the most successful data structure for tabling is tries. However, while tries are very efficient for variant based tabled evaluation, they are limited in their ability to recognize and represent repeated answers for different calls. We propose a new design for the table space where all tabled subgoal calls and tabled answers are stored in a common global trie instead of being spread over several different trie data structures. Our goal is to share data that is structurally equal, thus saving memory by reducing redundancy in term representation.